Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study
نویسندگان
چکیده
منابع مشابه
Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study
Although most scheduling problems are NP-hard, domain specific techniques perform well in practice but are quite expensive to construct. In adaptive problem-solving, domain specific knowledge is acquired automatically for a general problem solver with a flexible control architecture. In this approach, a learning system explores a space of possible heuristic methods for one well-suited to the ec...
متن کاملAn Adaptive Problem-Solving Solution to Large-Scale Scheduling Problems
Although the general class of most scheduling problems is NP-hard in worst-case complexity, in practice, domain-specific techniques frequently solve problems in much better than exponential time. Unfortunately, constructing special-purpose systems is a knowledge–intensive and time-consuming process that requires a deep understanding of the domain and problem-solving architecture. The goal of ou...
متن کاملA Statistical Approach to Adaptive Problem-Solving for Large-Scale Scheduling and Resource-Allocation Problems
Our work focuses upon development of techniques for choosing among a set of altematives in the presence of incomplete information and varying costs of acquiring information. In our approach, we model the cost and utility of various alternatives using parameterized statistical models. By applying techniques from an area of statistics called parameter estimation, statistical models can be inferre...
متن کاملA Hybrid Approach for Solving Large Scale Crew Scheduling Problems
We consider several strategies for computing optimal solutions to large scale crew scheduling problems. Provably optimal solutions for very large real instances of such problems were computed using a hybrid approach that integrates mathematical and constraint programming techniques. The declarative nature of the latter proved instrumental when modeling complex problem restrictions and, particul...
متن کاملSolving Large Scale Crew Scheduling Problems by using Iterative Partitioning
This paper deals with large-scale crew scheduling problems arising at the Dutch railway operator, Netherlands Railways (NS). NS operates about 30,000 trains a week. All these trains need a driver and a certain number of conductors. No available crew scheduling algorithm can solve such huge instances at once. A common approach to deal with these huge weekly instances, is to split them into sever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1996
ISSN: 1076-9757
DOI: 10.1613/jair.177